Optimal Control of a Queue With High-Low Delay Announcements: The Significance of the Queue

نویسندگان

  • Alexandra Koshman-Kaz
  • Refael Hassin
چکیده

This article deals with strategic control of price and information in a single-server model. It considers an M/M/1 system with identical customers. There is a single cut-off number, and the level of congestion is said to be low (high) if the queue length is less than (at least) this value. The firm can dynamically change the admission fee according to congestion level. Arriving customers cannot observe queue length, but are informed of the current level of congestion and the admission fee. The article deals with finding the profit-maximizing admission fee using analytical and numerical methods. We observe that such a pricing regime can be used to achieve profit equal to the maximum social welfare in this model and that the proportion of the increase relative to the single price unobservable queue is unbounded. We observe that the profit-maximizing threshold is usually quite small and therefore raise a question as to whether there is a significant difference in profit when customers only join the system when the server is idle We also investigate this question considering the classical observable model.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

VRED: An improvement over RED algorithm by using queue length growth velocity

Active Queue Management (AQM) plays an important role in the Internet congestion control. It tries to enhance congestion control, and to achieve tradeoff between bottleneck utilization and delay. Random Early Detection (RED) is the most popular active queue management algorithm that has been implemented in the in Internet routers and is trying to supply low delay and low packet loss. RED al...

متن کامل

VRED: An improvement over RED algorithm by using queue length growth velocity

Active Queue Management (AQM) plays an important role in the Internet congestion control. It tries to enhance congestion control, and to achieve tradeoff between bottleneck utilization and delay. Random Early Detection (RED) is the most popular active queue management algorithm that has been implemented in the in Internet routers and is trying to supply low delay and low packet loss. RED al...

متن کامل

An Improvement over Random Early Detection Algorithm: A Self-Tuning Approach

Random Early Detection (RED) is one of the most commonly used Active Queue Management (AQM) algorithms that is recommended by IETF for deployment in the network. Although RED provides low average queuing delay and high throughput at the same time, but effectiveness of RED is highly sensitive to the RED parameters setting. As network condition varies largely, setting RED's parameters with fixed ...

متن کامل

Unreliable Server Mx/G/1 Queue with Loss-delay, Balking and Second Optional Service

This investigation deals with MX/G/1 queueing model with setup, bulk- arrival, loss-delay and balking. The provision of second optional service apart from essential service by an unreliable server is taken into consideration. We assume that the delay customers join the queue when server is busy whereas loss customers depart from the system. After receiving the essential service, the customers m...

متن کامل

Optimal Control of Service Rate in a Service Center with Lapse (Research Note)

The purpose of this paper is to analyze the effect of a particular control doctrine applied to the service mechanism of a queuing process with lapse. It is assumed that the service discipline is FCFS (first come, first served), arrival process is Poisson, service time distribution is exponential, service process is one phase and the capacity is infinite. It is also assumed that the customer may...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • EAI Endorsed Trans. Energy Web

دوره 2  شماره 

صفحات  -

تاریخ انتشار 2014